Method and apparatus for improving channel estimate based on short synchronization code

ABSTRACT

A method and apparatus for estimating a communication channel impulse response h(t) is disclosed. The method comprises the steps of generating co m (t)=co(t+mNT c ) for m=0, 1, Λ, M by correlating a received signal r(t) with a spreading sequence S i  of length N, wherein the received signal r(t) comprises a chip sequence c j  applied to a communication channel characterizable by an impulse response h(t), and wherein the chip sequence C j  is generated from a data sequence d i  spread by the spreading sequence S i ; generating an estimated communication channel impulse response ĥ M (t) as a combination of co m (t) and d m  for m=0, 1, Λ, M; and filtering the first estimated communication channel impulse response ĥ M (t) to generate the estimated communication channel impulse response h(t) with a filter f selected at least in part according to the spreading sequence S i .

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is related to the following co-pending and commonly assigned patent application(s), all of which applications are incorporated by reference herein:

application Ser. No. ______, entitled “METHOD AND APPARATUS FOR REMOVING CODE ALIASES WHEN USING SHORT SYNCHRONIZATION CODES,” filed on same date herewith, by Haitao Zhang, attorney's docket number 020305.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to systems and methods for communicating information, and in particular to a system and method for estimating the impulse response of a communication channel using short synchronization codes.

2. Description of the Related Art

In packet-based communication systems, spreading codes are used for packet detection and synchronization purposes. Correlation techniques are used to identify and synchronize to its timing. In many instances, the spreading code sequence can be in the order of 1000 chips or more. Since the receiver must correlate through all possible delays, this process can result in unacceptable delays.

To ameliorate this problem, a short spreading code with good aperiodic autocorrelation can be used for packet detection and synchronization purposes. One example is the IEEE 802.11 Wireless Local Area Network (WLAN) system, which uses a length 11 Barker code as a spreading sequence for the preamble and the header of a packet. The short length of the spreading sequence makes it easy for receivers to quickly detect the presence of a packet in the communication channel and to synchronize to its timing.

In the case of a linear channel, for the purpose of receiver design, it is often desirable to estimate the impulse response of the communication channel. In the context of the WLAN, a multi-path linear channel is often utilized, and such communication channels require equalization for effective reception. Given an estimate of the impulse response of the communication channel, we can directly calculate equalizer coefficients through matrix computations, as opposed to the conventional adaptive algorithms. This is described in “Digital Communications,” by John G. Proakis, 4th edition, Aug. 15, 2000, which reference is hereby incorporated by reference herein. This allows equalizer coefficients to be computed in a digital signal processor (DSP) instead of in more expensive and less adaptable dedicated hardware implementing the adaptation algorithms.

Unfortunately, because the spreading code used is short (e.g. on the order of 11 symbols) a straightforward correlation using the spreading code will produce a distorted estimate. What is needed is a simple, computationally efficient technique that can be used to compute substantially undistorted communication channel impulse response estimates, even when the received signal was chipped with a short spreading code. The present invention satisfies that need.

SUMMARY OF THE INVENTION

To address the requirements described above, the present invention discloses a method and apparatus for estimating a communication channel impulse response h(t). The method comprises the steps of generating co_(m)(t)=co(t+mNT_(c)) for m=0, 1, Λ, M by correlating a received signal r(t) with a spreading sequence S_(i) of length N, wherein the received signal r(t) comprises a chip sequence c, applied to a communication channel characterizable by an impulse response h(t), and wherein the chip sequence c_(j) is generated from a data sequence d_(i) spread by the spreading sequence S_(i); generating an estimated communication channel impulse response ĥ_(M)(t) as a combination of co_(m)(t) and d_(m) for m=0, 1, Λ, M; and filtering the first estimated communication channel impulse response ĥ_(M)(t) to generate the estimated communication channel impulse response h(t) with a filter f selected at least in part according to the spreading sequence S_(i). The apparatus comprises a correlator for generating co_(m)(t)=co(t+mNT_(c)) for m=0, 1, Λ, M by correlating a received signal r(t) with a spreading sequence S_(i) of length N, wherein the received signal r(t) comprises a chip sequence C_(j) applied to a communication channel characterizable by an impulse response h(t), and wherein the chip sequence C_(j) is generated from a data sequence d_(i) spread by the spreading sequence S_(i); an estimator for generating an estimated communication channel impulse response ĥ_(M)(t) as a combination of co_(m)(t) and d_(m) for m=0, 1, Λ, M; and a filter f selected at least in part according to the spreading sequence S_(i), the filter for filtering the first estimated communication channel impulse response ĥ_(M)(t) to generate the estimated communication channel impulse response ĥ(t).

The foregoing permits the impulse response ĥ(t) of the communication channel to be accurately estimated, even with short chip codes. Non-intuitively, in the case of a time-limited channel impulse response, the present invention yields an estimate that can be made perfect in the limit of high signal-to-noise ratio (SNR).

BRIEF DESCRIPTION OF THE DRAWINGS

Referring now to the drawings in which like reference numbers represent corresponding parts throughout:

FIG. 1 is a diagram of a transceiver system;

FIG. 2 is a block diagram illustrating process steps that can be used to implement the present invention;

FIG. 3 is a diagram of a transceiver system utilizing a filter f to improve the estimated communication channel impulse response;

FIG. 4 is a diagram showing the response of the filter;

FIG. 5 is a flowchart describing exemplary processing steps that can be used to improve the reconstruction of the value of the communication channel impulse response using super codes imposed on the portion of the data sequence;

FIG. 6 is a diagram of a transceiver system utilizing super code to transmit sequences;

FIG. 7 is a diagram presenting a correlator output using 11 symbol long Barker code;

FIG. 8 is a diagram presenting a correlator output using Walsh codes as an input super code;

FIG. 9 is a diagram presenting a correlator output after postprocessing with a filter f as described in FIG. 2 and FIG. 3;

FIG. 10 is a diagram presenting a more detailed view of the main lobe peak, showing the estimate of the communication channel impulse response in the actual communications channel impulse response; and

FIG. 11 is a diagram presenting one embodiment of a processor that can be used to practice the present invention.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

In the following description, reference is made to the accompanying drawings which form a part hereof, and which is shown, by way of illustration, several embodiments of the present invention. It is understood that other embodiments may be utilized and structural changes may be made without departing from the scope of the present invention.

System Model

FIG. 1 is a diagram of a transceiver system 100. Using signal spreader 103, a random data symbol sequence d_(i) 102, comprising a series of data packets 128 (each of which may include a preamble 124 used by the receiver for identification purposes, as well as a data payload 126) is spread by a sequence S_(i) 104 of length N: {S_(n), 0≦,i≦N−1} and having a chip period. The sequence S_(i) 104 is known to the receiver 112 apriori. The spread chip sequence c_(j) 106 is therefore: c _(j) =c _(iN+n) =d _(i) •S _(n), 0≦n≦N−1  Eq. (1)

This spread chip sequence C_(j) 106 is transmitted through a linear transmission channel 108 having a combined channel impulse response h(t). The transmitted signal is received by a receiver 112. The received waveform r(t) 114 is: $\begin{matrix} {{r(t)} = {{\sum\limits_{j = {- \infty}}^{\infty}{c_{j}\quad\bullet\quad{h\left( {t - {j\quad T_{c}}} \right)}}} + {n(t)}}} & {{Eq}.\quad(2)} \end{matrix}$ where n(t) 121 is an additive noise component.

This formulation does not explicitly impose a causality requirement on h(t) 108. If explicit causality is desired, this can be accomplished by setting h(t)=0, t<0. For simplicity purposes, all the data and code sequences in the following discussion are assumed to be real, though the channel impulse response h(t) 108 and the additive noise component n(t) 121 could be complex in their baseband representations. Complex sequences could be easily accommodated if needed, but they are not common for synchronization purposes.

The receiver 112 receives the transmitted signal, and correlates the received signal r(t) 114 with the known spreading sequence S_(i) 104 to identify the data as intended to be received by the receiver 112. Once the received signal r(t) 114 is received, the preamble can be examined to determine the address of the data and whether further processing is necessary.

Such systems also use the received signal to estimate the input response of the communication channel 108. This information is used to improve later detection and reception of signals from the transmitter 110. In circumstances where the spreading sequence S_(i) 104 is relatively short, the data packet 128 must be detected quickly, and there is less data available to estimate the response of the communication channel 108. Conventional Detection and Synchronization

For detection and synchronization purposes, the search for the spreading code is conventionally performed by correlating the received signal r(t) 114 with the spreading sequence. This is accomplished by the correlator 116. Although this correlation is typically done after sampling in the time domain, for notational simplicity, we do not perform the time domain discretization. The correlator 116 output co(t) 118 is given by: $\begin{matrix} {{{co}(t)} = {\sum\limits_{i = 0}^{N - 1}{{r\left( {t + {\left( {N - 1} \right)T_{c}} - {i\quad T_{c}}} \right)}\quad\bullet\quad S_{N - i - 1}}}} & {{~~~~~~~~~~~~~~~~~~~~~~~~~~~~}{{Eq}.\quad(3)}} \\ {= {\sum\limits_{i = 0}^{N - 1}{{r\left( {t + {i\quad T_{c}}} \right)}\quad\bullet\quad S_{i}}}} & {{Eq}.\quad(4)} \\ {= {{\sum\limits_{i = 0}^{N - 1}{\sum\limits_{j = {- \infty}}^{\infty}{c_{j}\quad\bullet\quad{h\left( {t - {\left( {j - i} \right)T_{c}}} \right)}\quad\bullet\quad S_{i}}}} + {\overset{\sim}{n}(t)}}} & {{Eq}.\quad(5)} \\ {= {{\sum\limits_{l = {- \infty}}^{\infty}{\sum\limits_{i = 0}^{N - 1}{c_{l + i}\quad\bullet\quad S_{i}\quad\bullet\quad{h\left( {t - {l\quad T_{c}}} \right)}}}} + {\overset{\sim}{n}(t)}}} & {{Eq}.\quad(6)} \\ {= {{\sum\limits_{l = {- \infty}}^{\infty}{{D(l)}\quad\bullet\quad{h\left( {t - {l\quad T_{c}}} \right)}}} + {\overset{\sim}{n}(t)}}} & {{Eq}.\quad(7)} \end{matrix}$ where D(l) is the correlation between the chip sequence and the spreading sequence and we will refer to it as the chip correlation.

For notational simplicity, we have introduced a (negative) group delay (IT_(c)) in calculating the correlator output 118. The correlator 116 output is given by the convolution of the chip correlation D(l) with the sampled communication channel impulse response h(t−lT_(c)) plus a noise component n (t). Upon further examination: $\begin{matrix} {{D(l)} = {\sum\limits_{i = 0}^{N - 1}{c_{l + i}\quad\bullet\quad S_{i}}}} & {{~~~~~~~~~~~~~~}{{Eq}.\quad(8)}} \\ {= {{\sum\limits_{i = 0}^{N - 1 - n}{d_{m}\quad\bullet\quad S_{n + i}\quad\bullet\quad S_{i}}} + {\sum\limits_{i = {N - n}}^{N - 1}{d_{m + 1}\quad\bullet\quad S_{n + i - N}\quad\bullet\quad S_{i}}}}} & {{Eq}.\quad(9)} \\ {{= {{d_{m}\quad\bullet\quad{A(n)}} + {d_{m + 1}\quad\bullet\quad{A\left( {N - n} \right)}}}},} & {{Eq}.\quad(10)} \\ {{l = {{mN} + n}},{0 \leq n < N}} & {{Eq}.\quad(11)} \end{matrix}$  =d _(m) •A(n)+d _(m)+1•A(N−n),  Eq. (10) l=mN+n,0≦n≦N  Eq. (11) where A(n) is a two-sided aperiodic autocorrelation of the spreading sequence defined as: $\begin{matrix} {{{{A(n)} = {{A\left( {- n} \right)} = {\sum\limits_{i = 0}^{N - 1 - n}{S_{i}\quad\bullet\quad S_{i + n}}}}},{0 \leq n < N}}{{{A(n)} = 0},{{n} \geq N}}} & {{Eq}.\quad(12)} \end{matrix}$

A(n) is a property of the code sequence that is known by the correlator 116 apriori.

For detection and synchronization purposes, the spreading sequence S_(i) 104 is designed to have minimum values of A(k) when k≠0. However, for small (e.g. on the order of 10) values of N (short spreading codes), even the smallest side lobe magnitude is not negligible compared to the in-phase autocorrelation.

Barker sequences, when they exist, give the best aperiodic autocorrelation. For an 11 chip Barker sequence, S_(i) =1, −1, 1, 1, −1, 1, 1, 1, −1, −1, −1, the autocorrelation becomes A(i)=11, 0, −1, 0, −1, 0, −1, 0, −1, 0, −1 for 0≦i<11. Note that even for Barker codes, because the spreading sequence S_(i) 104 is of limited length, the autocorrelation A(i) includes significant side lobes.

The correlator 116 output 118 can be rewritten as: $\begin{matrix} {{{co}(t)} = {{\sum\limits_{j = {- \infty}}^{\infty}{\sum\limits_{i = 0}^{N - 1}{{D\left( {{j\quad N} + i} \right)}\quad\bullet\quad{h\left( {t - {\left( {{j\quad N} + i} \right)T_{c}}} \right)}}}} + {\overset{\sim}{n}(t)}}} & {{Eq}.\quad(13)} \\ {= {\sum\limits_{j = {- \infty}}^{\infty}{\sum\limits_{i = 0}^{N - 1}{\left( {{d_{j}\quad\bullet\quad{A(i)}} + {d_{j + 1}\quad\bullet\quad{A\left( {N - i} \right)}}} \right)\quad\bullet}}}} & {{Eq}.\quad(14)} \\ {{h\left( {t - {\left( {{j\quad N} + i} \right)T_{c}}} \right)} + {\overset{\sim}{n}(t)}} & \\ {= {\sum\limits_{j = {- \infty}}^{\infty}{\sum\limits_{i = 0}^{N - 1}{d_{j}\quad\bullet\quad\left( {{{A(i)}\quad\bullet\quad{h\left( {t - {\left( {{j\quad N} + i} \right)T_{c}}} \right)}} + {{A\left( {N - i} \right)}\quad\bullet}} \right.}}}} & {{Eq}.\quad(15)} \\ {\left. {h\left( {t - {\left( {{\left( {j - 1} \right)N} + i} \right)T_{c}}} \right)} \right) + {\overset{\sim}{n}(t)}} & \\ {= {{\sum\limits_{j = {- \infty}}^{\infty}{\sum\limits_{i = {{- N} + 1}}^{N - 1}{d_{j}\quad\bullet\quad{A(i)}\quad\bullet\quad{h\left( {t - {j\quad{NT}_{c}} - {iT}_{c}} \right)}}}} + {\overset{\sim}{n}(t)}}} & {{Eq}.\quad(16)} \\ {= {{\sum\limits_{j = {- \infty}}^{\infty}{d_{j}\quad\bullet\quad{\hat{h}\left( {t - {j\quad{NT}_{c}}} \right)}}} + {\overset{\sim}{n}(t)}}} & {{Eq}.\quad(17)} \end{matrix}$ where the following is defined as the convolution of the spreading sequence aperiodic autocorrelation A(i) and the sampled channel impulse response h(t−iT_(c)) as follows: $\begin{matrix} {{\hat{h}(t)} = {\sum\limits_{i = {{- N} + 1}}^{N - 1}{{A(i)}\quad\bullet\quad{h\left( {t - {iT}_{c}} \right)}}}} & {{Eq}.\quad(18)} \end{matrix}$

This is an estimate of the combined communication channel 108 impulse response ĥ(t) at the output of the code correlator 116.

The above equations can be more succinctly written using a convolutional notation. Defining a convolution of two infinite sequences A_(i) and B_(i) as $\begin{matrix} {{C = {\left. {A \otimes B}\Leftrightarrow{C(i)} \right. = {\sum\limits_{j}{{A(j)}\quad\bullet\quad{B\left( {i - j} \right)}}}}},{\forall i}} & {{Eq}.\quad(19)} \end{matrix}$

By defining an operator ${\overset{\iota}{O}}^{T}$ that converts any sequence O to a time domain function using the Dirac delta function: $\begin{matrix} {{{\overset{\iota}{B}}^{T}(t)} \equiv {\sum\limits_{i}{{B(i)}\quad\bullet\quad{\delta\left( {t - {iT}} \right)}}}} & {{Eq}.\quad(20)} \end{matrix}$

-   -   we can also define the convolution of a function with a sequence         using a normal convolution of two functions: $\begin{matrix}         {{C(t)} = {\left. {{A(t)} \otimes {\overset{\iota}{B}}^{T}}\Leftrightarrow{C(t)} \right. = {\sum\limits_{j}{{A\left( {t - {j\quad T}} \right)}{B(j)}}}}} & {{Eq}.\quad(21)}         \end{matrix}$

Using the above notations and further, by adopting the following definitions: u(iN)=d _(i)(data)  Eq. (22A) u(iN+n)=0,0<n<N  Eq. (22B) $\begin{matrix} {{S(n)} = \left\{ {\begin{matrix} {S_{n},} & {0 \leq n < N} \\ {0,} & {otherwise} \end{matrix}\text{(a~~time-limited~~chipping~~sequence)}} \right.} & {{Eq}.\quad\left( {22C} \right)} \end{matrix}$ the foregoing equations (1), (2), (3), (6), (12), (18), (16), (17) can be rewritten as: c=u{circle over (×)}S  Eq. (1′) $\begin{matrix} {c = {u \otimes S}} & {\text{Eq.~~}\left( 1^{\prime} \right)} \\ {r = {h \otimes_{C}^{\tau_{T_{c}}}{+ n_{o}}}} & {\text{Eq.~~}\left( 2^{\prime} \right)} \\ {{co} = {r \otimes {\overset{\iota}{S}}_{-}^{T_{c}}}} & {\text{Eq.~~}\left( 3^{\prime} \right)} \\ {\quad{{= {{h \otimes_{C}^{\tau_{T_{c}}}{\otimes {\overset{\iota}{S}}_{-}^{T_{c}}}} + \overset{\sim}{n}}},{{{where}\quad{S_{-}(n)}} = {S\left( {- n} \right)}}}\quad} & {\text{Eq.~~}\left( 6^{\prime} \right)} \\ {A = {S \otimes S_{-}}} & {\text{Eq.~~}\left( 12^{\prime} \right)} \\ {\hat{h} = {h \otimes {\overset{\iota}{A}}^{T_{c}}}} & {\text{Eq.~~}\left( 18^{\prime} \right)} \\ {{co} = {\hat{h} \otimes_{u}^{\tau_{T_{c}}}{+ \overset{\sim}{n}}}} & {\text{Eq.~~}\left( 16^{\prime} \right)} \\ {\quad{= {{\hat{h} \otimes {\overset{\iota}{d}}^{{NT}_{c}}} + \overset{\sim}{n}}}} & {\text{Eq.~~}\left( 17^{\prime} \right)} \end{matrix}$

Determining a Communication Channel Impulse Response Estimate

For simplicity of notation, in the remaining discussion, we assume that data symbols are binary. The results however, can be generally applied to non-binary data.

Because the correlator 116 has access to the same code sequence S_(i) 104 that was used to generate the spread chip sequence c_(j) 106 before transmission, the correlator 116 can correlate the received signal r(t) 114 with the code sequence S_(i) 104. However, aliasing can occur with short code sequences S_(i) 104, because time delays may cause the correlator 116 to correlate different portions of adjacent code sequences. Conventionally, these aliasing effects are reduced by integrating or summing over multiple (e.g. M) code periods, as discussed below.

As described in Eqs. (13)-(17), based on the correlator 116 output 118 we can form an estimate of the channel impulse response over one code period T_(c): $\begin{matrix} \begin{matrix} {{{\hat{h}}_{1}(t)} = {d_{0}\quad\bullet\quad{{co}(t)}}} \\ {= {{\hat{h}(t)} + {\sum\limits_{j \neq 0}{d_{0}\quad\bullet\quad d_{j}\quad\bullet\quad{\hat{h}\left( {t - {jNT}_{c}} \right)}}} + {d_{0}\quad\bullet\quad{\hat{n}(t)}}}} \end{matrix} & {{Eq}.\quad(23)} \end{matrix}$ where d₀ is a value of the data at time t=0.

This is a rough approximation to ĥ(t), corrupted by aliased copies of ĥ(t) spaced at multiples of NT_(c), away from the desired copy. These aliasing and the additive noise terms can be reduced through further summation over M code periods: $\begin{matrix} {{{\hat{h}}_{M}(t)} = {\frac{1}{M}{\sum\limits_{m = 0}^{M - 1}{d_{m}\quad\bullet\quad{{co}\left( {t + {mNT}_{c}} \right)}}}}} & {{~~~}{{Eq}.\quad(24)}} \\ {= {{\hat{h}(t)} + {\frac{1}{M}{\sum\limits_{m = 0}^{M - 1}{\sum\limits_{j \neq m}{d_{m}\quad\bullet\quad d_{j}\quad\bullet\quad{\hat{h}\left( {t + {\left( {m - j} \right){NT}_{c}}} \right)}}}}} +}} & {{Eq}.\quad(25)} \\ {{\overset{\sim}{n}}_{M}^{\prime}(t)} & \\ {= {{\hat{h}(t)} + {\frac{1}{M}{\sum\limits_{l \neq 0}{\sum\limits_{m = 0}^{M - 1}{d_{m}\quad\bullet\quad d_{l + m}\quad\bullet\quad{\hat{h}\left( {t - {lNT}_{c}} \right)}}}}} + {{\overset{\sim}{n}}_{M}^{\prime}(t)}}} & {{Eq}.\quad(26)} \end{matrix}$

The foregoing indicates that through output 122 of estimator 120, by removing the data modulation through correlation with the data sequence, we obtain an estimate ĥ of the channel impulse response plus terms defined by the autocorrelation of the data sequence, which vanish when summed over infinite terms.

If D_(M)(l) is defined as: $\begin{matrix} {{D_{M}(l)} = {\frac{1}{M}{\sum\limits_{m = 0}^{M - 1}{d_{m}\quad\bullet\quad d_{l + m}\quad{then}}}}} & {{Eq}.\quad(27)} \\ {{\hat{h}}_{M} = {{\hat{h} \otimes {\overset{\iota}{D}}_{M}^{{NT}_{c}}} + {\overset{\sim}{n}}_{M}^{\prime}}} & {{Eq}.\quad(28)} \end{matrix}$

-   -   wherein ĥ_(M) is an estimate of the communication channel         impulse response h(t). When the data sequence d_(i) 102 is         random, white and independent of the additive noise n(t) 121,         and in the limit of M→∞: $\begin{matrix}         {{{{D_{\infty}(l)} = \delta_{l0}},{{\overset{\sim}{n}}_{\infty}^{\prime} = 0}}{{\hat{h}}_{\infty} = \hat{h}}} & {{Eqs}.\quad(29)}         \end{matrix}$

Therefore, in the limit of infinite summation (as M approaches infinity), we obtain an estimate that is equal to the true channel impulse response h(t) convolved with the aperiodic autocorrelation of the spreading sequence S_(i) 104.

As the foregoing demonstrates, we can not obtain the true channel impulse response h(t) with simple integration. The best we have is smeared by the autocorrelation of the spreading sequence S_(i) 104. In cases where the spreading sequence S_(i) 104 is long, the autocorrelation approaches a delta function, and the side lobes disappear. However, when the spreading sequence S_(i) 104 is short, the sidelobes of the autocorrelation are not negligible and will cause significant distortion to the estimate of the communication channel impulse response h(t).

Improved Channel Estimates for Short Spreading Sequences

As is demonstrated below, the present invention improves the communication channel impulse response estimate by filtering the first estimated communication channel impulse response ĥ_(M)(t) to generate the estimated communication channel impulse response h(t) with a filter f selected at least in part according to the spreading sequence S_(i). In particular, when the time span of the communication channel 108 is limited, a zero-forcing deconvolution can be used to improve the estimate.

FIG. 2 is a block diagram illustrating process steps that can be used to implement the present invention.

FIG. 3 is a diagram of a transceiver system 300 utilizing the filter f described above to filter the first estimated communication channel impulse response ĥ_(M)(t) to generate an improved estimate suitable for short spreading sequences S_(i) 104.

Referring to FIG. 2 and FIG. 3, blocks 202 through 208 recite steps that are used to generate co_(m)(t) 118. A spread chip sequence C_(j) 106 is generated from a data symbol sequence d_(i) 102 and a spreading sequence S_(i) 104 of length N, as shown in block 202. The chip sequence c_(j) 106 is transmitted via a communication channel 108 as shown in block 204, and received as shown in block 206. The communication channel includes the transmitter 110 and the receiver 112. The received signal r(t) 114 is then correlated with the spreading sequence S_(i) 104, by the correlator 116 to generate co_(m)(t) as shown in block 208.

In block 210, an estimated communications channel impulse response ĥ_(M)(t) is generated by the estimator 120 as a combination of co_(m)(t) and d_(m) for m=0, 1, K, M This can be accomplished, for example using the relationship described in Eq. (24) above.

Finally, in block 212, the first estimated communication channel response ĥ_(M)(t) is filtered with a filter f selected at least in part according to the spreading sequence S_(i) 104. In one embodiment, the filter is a finite impulse response (FIR) filter f 302 designed with the following constraints: A _(f)=A{circle over (×)}f  Eq. (29) A _(f)(0)=1,A _(f)(n)=0,0<|n|≦L  Eq. (30) wherein A{circle over (×)}f is the convolution of the autocorrelation of the spreading sequence S_(i) 104 and the filter, and A_(f) is the autocorrelation of the spreading sequence S_(i) 104 after filtering.

FIG. 4 is a diagram showing the response of the filter f 302 described in Eqs. (29) and (30).

When the estimate of the communication channel impulse response is filtered with this filter, we obtain: $\begin{matrix} \begin{matrix} {h_{f} = {\hat{h} \otimes {\overset{\iota}{f}}^{T_{c}}}} \\ {= {h \otimes {\overset{\tau}{A}}^{T_{c}} \otimes {\overset{\tau}{f}}^{T_{c}}}} \\ {= {h \otimes {\overset{\tau}{A}}_{f}^{T_{c}}}} \end{matrix} & {{Eq}.\quad(31)} \end{matrix}$

Using this technique, the effects of the side lobes (aliased versions of the autocorrelation of the spreading sequence S_(i) 104) are eliminated between L and −L. The side lobes are not completely removed (since the filter passes components greater than L and less than −L) but the result near the origin (n=0) is of primary interest, and the effect of the side lobes can be significantly reduced in this region.

If the time span (duration of the impulse response) of the communications channel is less than LT_(c), i.e. ∃t ₁ <t ₂ ,t _(2−t) ₁ <LT _(c) , ∀t<t ₁ ∪t>t ₂ :h(t)≈0  Eq. (32) (that is, there exists a time t₂ greater than t₁ defining a time interval t₂−t₁ less than LT_(c), and for all time outside of the interval t₂−t₁, h(t) is close to zero),

Then, the filtered estimate h_(f) (or, in the earlier notation, h_(f) (t)) is composed of an exact copy of h (h(t)), plus some aliased versions of it in non-overlapping locations. So in this case h is resolvable from h_(f).

Such a filter with length 2L+1 can be designed with the simple zero-forcing criteria: $\begin{matrix} {{{\sum\limits_{i = {- L}}^{L}{{A\left( {n - i} \right)}\quad\bullet\quad{f(i)}}} = {A_{f}(n)}},{{- L} \leq n \leq L}} & {{Eq}.\quad(33)} \end{matrix}$ wherein f(i) is the impulse response of the filter f 302 such that A_(f) (n) is a convolution of A(n) and f(i), A_(f) (n)=1 for n=0 and A_(f) (n)=0 for 0<|n|≦L, and ${{A(n)} = {{A\left( {- n} \right)} = {\sum\limits_{i = o}^{N - 1 - n}{S_{i}\quad\bullet\quad S_{i + n}}}}},{0 \leq n \leq N},$ and wherein N is a length of the chip sequence S_(i) 104. L can be chosen such that the product LT_(c) (the chip period T_(c) is known) is approximately equal to the time span (e.g. the approximate duration of the impulse response) of the channel 108.

Note that the value A(n−i) is well defined . . . it is a property of the spreading sequence S_(i) 104, which is known apriori.

As usual, the matrix structure of the linear equations is Toeplitz. By the design requirement of the spreading sequence S_(i), the matrix should be well conditioned. The filter coefficients can be computed offline given the spreading sequence and desired window width L.

While the foregoing has been described in respect to non recursive filters, other filters, such as recursive filters may also be used. A recursive filter, for example, may provide perfect filtering of the sidelobes, but the result may not be the quell conditioned matrix, hence the solution may be more difficult to determine. In fact, any filter of length 2L+1 can be defined.

Super Coded Transmit Sequences

It has been shown that given ĥ and with filtering, it is possible to recover the true channel impulse response for a time limited channel. However, in the foregoing discussion, ĥ was obtained through integration over multiple spreading sequence periods. The number of periods we need to integrate over can be large especially if 2L≧N, since we rely on the autocorrelation of the data to suppress the aliased copies of ĥ.

In one embodiment of the present invention, supercodes, such as Walsh-like supercodes, are used to drastically reduce the amount of the integration required. This technique is especially useful in systems having sufficient a signal-to-noise ratio (SNR).

Consider a pair of length 2 Walsh codes w₀ {+1, +1} and w₁ {+1, −1}. These codes can be used to form a data sequence:

. . . +,+,+,−,−,− . . .

Any length 2-symbol length segment from this sequence can be described as either w₀ or −w₀, except for a single w₁ in the center. If this sequence is now correlated with w₁, the resulting correlation will be characterized by a single peak in the center and zeros elsewhere (except near the boundaries). Negatives of the two codes may be taken (e.g. w₀={−1,−1} and w₁={−1,+1}and/or their roles may be swapped (e.g. w₁={+1, +1} and w₀={+1,−1} with the same result. The three additional patterns thus obtained and their correlator patterns are listed below: . . . −, −, −, −, +, +, +, + . . . −, + . . . −, +, −, +, +, −, +, − . . . +, + . . . +, −, +, −, −, +, −, + . . . −, −

Since the following results are equivalent for all of the above patterns when the additive noise is uncorrelated at sampling points, we limit our discussion to the first data sequence (i.e. . . . +,+,+,−,−,− . . . ). In this case, d _(i)=+1,∀l ₁ <i≦0  Eq. (34) d _(i)=−1,∀l ₂ ≧i>0  Eq. (35) $\begin{matrix} {{{\hat{h}}_{2}(t)} = {\frac{1}{2}\left( {{d_{0}\quad\bullet\quad{{co}(t)}} + {d_{1}\quad\bullet\quad{{co}\left( {t + {NT}_{c}} \right)}}} \right)}} & {{~~~~~~~~~~}{{Eq}.\quad(36)}} \\ {= {{\hat{h}(t)} + {\sum\limits_{l \neq 0}{\left( {d_{l} - d_{l + 1}} \right)\quad\bullet\quad{\hat{h}\left( {t - {lNT}_{c}} \right)}}} + {{\overset{\sim}{n}}_{2}^{\prime}(t)}}} & {{Eq}.\quad(37)} \\ {= {{\hat{h}(t)} + {\sum\limits_{l \leq {l_{1}\bigcup l} \geq l_{2}}{\left( {d_{l} - d_{l + 1}} \right)\quad\bullet\quad{\hat{h}\left( {t - {lNT}_{c}} \right)}}} + {{\overset{\sim}{n}}_{2}^{\prime}(t)}}} & {{Eq}.\quad(38)} \end{matrix}$

If the condition that −l₁N>(2N+L)Il₂N>(2N+L) can be satisfied, ĥ can be reconstructed free of aliasing interference, and by deconvolution (aforementioned filtering technique), h can be reconstructed as well.

From the foregoing, it can be determined that a small supercode imposed on a portion of the data sequence can provide an alias free estimate of the communication channel impulse response when the channel response is time-limited. The only source of distortion from this estimate comes from the additive noise, which can be suppressed by the spreading gain times a factor of 2 (to account for the supercode). When the noise is low, such an approach is preferable over long integrations.

For moderate values of L, such code sequences can be easily embedded within a longer preamble to packet data, probably with multiple copies, without adversely affecting the spectrum properties of the transmission. In addition, when the signal to noise ratio (SNR) is low, traditional integration as outlined in the first half of this section can still be carried out on such a preamble to obtain a higher processing gain against the additive noise.

FIG. 5 is a flowchart describing exemplary processing steps that can be used to improve the reconstruction of the value of the communication channel impulse response by using supercode imposed on a portion of the data sequence.

FIG. 6 is a diagram of a transceiver system 600 utilizing super coded transmit sequences to generate an improved communication channel impulse response estimate suitable for short spreading sequences S_(i) 104.

In block 502, a data sequence d_(i) 102 is generated. The data sequenced d_(i) 102 includes one or more data packets 128, each data packet having a preamble 124 including a constrained portion Cd_(i) 602. The preamble 124, can be, for example, in the form of a pseudorandom code.

The constrained portion Cd_(i) 602 is associated with at least two codes, w₀ and w₁. The codes w₀ and w₁ are selected such that the correlation A_(code)(k) of the constrained portion Cd_(i) 602 and at least one of the codes w₀ and w₁, is characterized by a maximum value at k=0, and they value less than the maximum value at k≠0.

Ideally, the correlation A_(code)(k) of the constrained portion Cd_(i) 602 is an impulse, with A_(code)(k) equal to one at k=0, and equal at all other values for k. However, because such correlation characteristics are typically not realizable, codes w₀ and w₁ can be chosen to approximate this ideal. For example, codes w₀ and w₁ can be chosen such that the correlation A_(code)(k) of the constrained portion Cd_(i) 602 and at least one of the codes w₀ and w₁, is such that A_(code)(k)=1 at k=0 and A_(code)(k)≈0 for substantially all k ≠0. Or, codes w₀ and w₁ can be chosen such that the correlation A_(code)(k) of the constrained portion Cd_(i) 602 and at least one of the codes w₀ and w₁, is such that A_(code)(k)=0 for 0<|k|≦J wherein J is selected to minimize the correlation of the constrained portion Cd_(i) with the one of the codes w₀, w₁ for substantially all k≠0.

In one embodiment, the constrained portion Cd_(i) 602 comprises the pair of length two Walsh codes in the first sequence described above. Other embodiments are envisioned in which the codes are of another length (other than length two), or are codes other than a Walsh code.

In block 504, a chip sequence c_(j) 106 is generated. The chip sequence c_(j) 106 is generated by applying a spreading sequence S_(i) 104 of length N and having a chip period T_(c) to the data sequence d_(i) 102.

This spread chip sequence c_(j) 106 is transmitted through a linear transmission channel 108 having a combined channel impulse response h(t). The transmitted signal is received by a receiver 112.

In block 506, the receiver 112 receives the transmitted signal, and correlates the received signal r(t) 114 with the known spreading sequence S_(i) 104 to identify the data as intended to be received by the receiver 112. This is accomplished by generating co_(m)(t)=co(t+mNT_(c)) for m=0, 1, Λ, M, using techniques analogous to those which were described above.

In block 508, an estimated communication channel impulse response ĥ_(M)(t) is generated as a combination of the correlation co_(m)(t) and the data sequence d_(m) for m=0, 1, Λ, M.

In one embodiment, the codes w₀ and w₁ are two symbol-long Walsh codes, and ĥ_(M)(t) computed as ${\frac{1}{M}{\sum\limits_{m = 0}^{M - 1}{d_{m}\quad\bullet\quad{{co}\left( {t + {mNT}_{c}} \right)}}}},$ with M=2. In this case, ĥ_(M)(t) equals ${{\hat{h}}_{2}(t)} = {\frac{1}{2}{\left( {{d_{0}\quad\bullet\quad{{co}(t)}} + {d_{1}\quad\bullet\quad{{co}\left( {t + {NT}_{c}} \right)}}} \right).}}$

Hence, where the data has been constrained with a symbol such as a Walsh super code, an improved estimate of the communications channel impulse response can be obtained by taking two consecutive values of the correlation of the received data and the spreading sequence and multiplying each result by the data sequence. In the example of Walsh codes w₀={−1, −1} and w₁ ={−1, +1} applied to the sequence . . . +,+,+,−,−,− . . . , and w₁ applied at the receiver, the result is that one of the values of co(t) is multiplied by a one, and the other is multiplied by a minus one. Hence, the output will produce essentially no response until the transition between the two Walsh codes occurs, at which time a clean, alias-free copy of the communications channel impulse response will be produced.

A length 2 supercode for improved alias suppression has been described. When the SNR is low and longer integration period is desirable, it would appear attractive to generalize the code to longer lengths. Counterintuitively, this is not possible. This result is shown below, by presenting a definition of such codes and showing that no such codes with length larger than 2 exist for binary data sequences.

An infinite sequence A forms an impulsive correlation pair with a length L finite sequence B if A satisfies the following equations: A(i)=B(i), ∀0≦i<L ${{\sum\limits_{i = 0}^{L - 1}{{A\left( {i + n} \right)} \cdot {B(i)}}} = 0},{\forall{n \neq 0}}$

By contradiction, it can be shown that for binary sequences, such a pair does not exist for L>2. Supposing such sequences exist, it is apparent that L must be even. Considering two such cases (L=4k and L=4k+2)

In the first case, L=4k, consider the first constraint: $\begin{matrix} {{{\sum\limits_{i = 0}^{L - 1}{{A\left( {i - 1} \right)} \cdot {B(i)}}} = 0},} & {{Eq}.\quad\left( {39a} \right)} \\ {{{{A\left( {- 1} \right)} \cdot {B(0)}} + {\sum\limits_{i = 1}^{L - 1}{{B\left( {i - 1} \right)} \cdot {B(i)}}}} = 0} & {{Eq}.\quad\left( {39b} \right)} \end{matrix}$

Since there are 4k summands in the equation taking values from {+1, −1} half of them or 2k terms must be positive, and the other half negative. The product of all the summands must therefore be 1. $\begin{matrix} {{{{A\left( {- 1} \right)} \cdot {B(0)} \cdot {\prod\limits_{i = 1}^{L - 1}\left( {{B\left( {i - 1} \right)} \cdot {B(i)}} \right)}} = 1}{{{A\left( {- 1} \right)} \cdot {B\left( {L - 1} \right)}} = 1}{{A\left( {- 1} \right)} = {B\left( {L - 1} \right)}}} & {{Eqs}.\quad(40)} \end{matrix}$

Similar arguments can be used to show that: A(i)=B(L+i),−L<i<0  Eq. (41)

But this implies that: $\begin{matrix} \begin{matrix} {{\sum\limits_{i = 0}^{L - 1}{{A\left( {i - L} \right)} \cdot {B(i)}}} = {{{A\left( {- L} \right)} \cdot {B(0)}} + {\sum\limits_{i = 1}^{L - 1}{{A\left( {i - L} \right)} \cdot {B(i)}}}}} \\ {= {{{A\left( {- L} \right)} \cdot {B(0)}} + {\sum\limits_{i = 1}^{L - 1}{{B(i)} \cdot {B(i)}}}}} \\ {= {{{A\left( {- L} \right)} \cdot {B(0)}} + L - 1}} \\ {> 0} \end{matrix} & {{Eqs}.\quad(42)} \end{matrix}$ which contradicts the assumption that the cross-correlation is zero everywhere except at the origin. Hence, by contradiction, we have shown that for binary sequences, such a pair does not exist for L>2.

A similar argument can be applied for the second case, L=4k+2, except that the product of all the summands in each equations must be −1, since now we must have 2k+1 negative terms. This leads to: A(i)=(−1)^(i) B(L+i),−L<i<0  Eq. (43)

When k>0, $\begin{matrix} {{{\sum\limits_{i = 0}^{L - 1}{{A\left( {i - 2} \right)} \cdot {B(i)}}} = {{{{A\left( {- 2} \right)} \cdot {B(0)}} + {{A\left( {- 1} \right)} \cdot {B(1)}} + {\sum\limits_{i = 2}^{L - 1}{{A\left( {i - 2} \right)} \cdot {B(i)}}}}\quad = {{{{B\left( {L - 2} \right)} \cdot {B(0)}} - {{B\left( {L - 1} \right)} \cdot {B(1)}} + {\sum\limits_{i = 2}^{L - 1}{{B\left( {i - 2} \right)} \cdot {B(i)}}}}\quad = 0}}}{{\sum\limits_{i = 0}^{L - 1}{{A\left( {i - L + 2} \right)} \cdot {B(i)}}} = {{{\sum\limits_{i = 0}^{L - 3}{{A\left( {i - L + 2} \right)} \cdot {B(i)}}} + {{A(0)} \cdot {B\left( {L - 2} \right)}} + {{A(1)} \cdot {B\left( {L - 1} \right)}}}\quad = {{{\sum\limits_{i = 0}^{L - 3}{\left( {- 1} \right)^{i}{{B\left( {i + 2} \right)} \cdot {B(i)}}}} + {{B(0)} \cdot {B\left( {L - 2} \right)}} + {{B(1)} \cdot {B\left( {L - 1} \right)}}}\quad = {{{{B\left( {L - 2} \right)} \cdot {B(0)}} + {{B\left( {L - 1} \right)} \cdot {B(1)}} + {\sum\limits_{i = 2}^{L - 1}{\left( {- 1} \right)^{i}{{B\left( {i - 2} \right)} \cdot {B(i)}}}}}\quad = 0}}}}} & {{Eqs}.\quad(44)} \end{matrix}$

Summing the two equations together we have: $\begin{matrix} {{{{B\left( {L - 2} \right)} \cdot {B(0)}} + {\sum\limits_{i = 1}^{2k}{{B\left( {{2i} - 2} \right)} \cdot {B\left( {2i} \right)}}}} = 0} & {{Eq}.\quad(45)} \end{matrix}$

However, this result is clearly impossible since there are an odd number of terms on the left. By contradiction it is therefore shown that it is impossible to satisfy the constraints when L>2 for binary sequences.

Noise Effects

The foregoing has demonstrated that distortions due to this spreading sequence design can be removed from the estimate of the communications channel impulse response. Attention is now turned to the remaining distortion caused by the additive noise. n(t) 121. Assuming that the noise source is white and stationary and is filtered by a receiver filter for bandwidth matching, its distortion measure can be defined as follows: $\begin{matrix} {\Delta = {E\left\lbrack {\frac{1}{t_{2} - t_{1}}{\int_{t_{1}}^{t_{2}}{{{{\overset{\sim}{n}}_{M}^{\prime\prime}(t)}}^{2}{\mathbb{d}t}}}} \right\rbrack}} & {{Eq},\quad(46)} \\ {{\overset{\sim}{n}}_{M} = {{\overset{\sim}{n}}_{M}^{\prime} \otimes f^{T_{c}}}} & {{Eq}.\quad(47)} \\ \begin{matrix} {{{\overset{\sim}{n}}_{M}^{\prime\prime}(t)} = {\sum\limits_{l = {- L}}^{L}{{{\overset{\sim}{n}}_{M}^{\prime}\left( {t - {lT}_{c}} \right)} \cdot {f(l)}}}} \\ {= {\frac{1}{M}{\sum\limits_{l = {- L}}^{L}{\sum\limits_{m = 0}^{M - 1}{d_{m} \cdot {\overset{\sim}{n}\left( {t + {mNT}_{c} - {lT}_{c}} \right)} \cdot {f(l)}}}}}} \\ {= {\frac{1}{M}{\sum\limits_{l = {- L}}^{L}{\sum\limits_{m = 0}^{M - 1}{\sum\limits_{i}{d_{m} \cdot {n\left( {t + {mNT}_{c} + {iT}_{c} - {lT}_{c}} \right)} \cdot {S(i)} \cdot {f(l)}}}}}}} \\ {= {\frac{1}{M}{\underset{m = 0}{\sum\limits^{M - 1}}{\sum\limits_{j}{d_{m} \cdot {n\left( {t + {mNT}_{c} + {jT}_{c}} \right)} \cdot {R_{fS}(j)}}}}}} \end{matrix} & {{Eqs}.\quad(48)} \\ {where} & \quad \\ {{R_{fS}(j)} = {\sum\limits_{l = {- L}}^{L}{{f(l)} \cdot {S\left( {l + j} \right)}}}} & {{Eq}.\quad(49)} \end{matrix}$

The ensemble expectation of Eq. (46) can be taken over n(t), whose autocorrelation can be determined by the front end receive filter, and is assumed to be known). $\begin{matrix} \begin{matrix} {{R_{nn}(\tau)} = {E\left\lbrack {{n_{0}^{*}(t)} \cdot {n_{0}\left( {t + \tau} \right)}} \right\rbrack}} \\ {\Delta = {\frac{1}{M^{2}}{\sum\limits_{m^{\prime} = 0}^{M - 1}{\sum\limits_{m = 0}^{M - 1}{\sum\limits_{j^{\prime}}{\sum\limits_{j}{d_{m} \cdot {R_{fS}(j)} \cdot {R_{nn}\left( {{\left( {m^{\prime} - m} \right){NT}_{c}} +} \right.}}}}}}}} \\ {\left. {\left( {j^{\prime} - j} \right)T_{c}} \right) \cdot {R_{fS}\left( j^{\prime} \right)} \cdot d_{m}^{\prime}} \\ {= {\sum\limits_{j^{\prime}}{\sum\limits_{j}{{{\overset{\_}{R}}_{fS}^{M}(j)} \cdot {R_{nn}\left( {\left( {j^{\prime} - j} \right)T_{c}} \right)} \cdot {{\overset{\_}{R}}_{fS}^{M}\left( j^{\prime} \right)}}}}} \end{matrix} & {{Eqs}.\quad(50)} \\ {{{\overset{\_}{R}}_{fS}^{M}(j)} = {\frac{1}{M}{\sum\limits_{m = 0}^{M - 1}{d_{m} \cdot {R_{fS}\left( {j + {mN}} \right)}}}}} & {{Eq}.\quad(51)} \end{matrix}$

When the noise n(t) is white, we have: $\begin{matrix} {{{{R_{nn}\left( {kT}_{c} \right)} = 0},{\forall{k \neq 0}}}{\Delta = {{R_{nn}(0)}{\sum\limits_{j}{{{\overset{\_}{R}}_{fS}^{M}(j)}}^{2}}}}} & {{Eq}.\quad(52)} \end{matrix}$

EXAMPLES

FIG. 7 through FIG. 10 are diagrams illustrating the performance improvements achieved by application of the present invention. These illustrated examples and places them, whereby a length 11 Barker code is used as the spreading sequence S_(i) 104. FIGS. 7-10, normalized magnitudes as a function of chip timing. No adjustments were made for group delays introduced by correlation, filtering and windowing, therefore time coordinates should be treated in the relative sense. FIGS. 7-10 also do not include the effects of additive noise.

FIG. 7 is a diagram presenting a correlator 116 output using a length 11 Barker code and conventional communication channel impulse response estimation techniques. The correlator 116 output shows a main lobe peak 702, and multiple spurious peaks 704. These spurious peaks 704 (which are 11 chips, or NT_(c) seconds, apart due to the length 11 Barker code) are due to the repeated transmission of the short code S_(i) 104, which are “aliased” back upon each other. If the length of the periodic spreading sequence S_(i) 104 were longer, there would be fewer spurious peaks 704, and the peaks 704 would not overlap the main lobe peak 702 as much as is shown in FIG. 7.

FIG. 8 is a diagram presenting a correlator 116 output using the Walsh codes in conjunction with the supercode technique described in FIG. 5. To generate this plot, the input data was constrained with two symbol-long Walsh codes w₀ and w₁, and the output was processed by summing two successive outputs of the correlator 116 as shown in Eq. (36). For the 11 chips on either side of the main lobe peak 702, there is zero correlation, and many of the spurious correlator peaks 704 that were apparent in FIG. 7 are no longer evident. Note, however that since only six bits of the data sequence are constrained . . . +,+,+,−,−,− . . . , some aliased versions of the main lobe peak 704 (labeled 802) are present (33 chips from the main lobe peak 702). However, since these aliased versions 802 are widely separated from the main lobe peak 702, an accurate estimate of the communications channel impulse response can be obtained. Note that a similar result can also be achieved without constraining the input sequence with the super code, but this would require integration over large number of symbols (e.g. M in Eq. (26) would be large). Note also that the main lobe peak 704 still includes minor peaks because the estimator 120 produces ĥ, which is a smeared version of h. These undesirable components 804, caused by the autocorrelation of the spreading sequence 104, cannot be removed by constraining the data sequence. Instead, these undesirable components 804 can be removed by filtering as described with respect to FIG. 9 below.

FIG. 9 is a diagram presenting a correlator 116 output shown in FIG. 8 after postprocessing with a filter f as described in FIGS. 2 and 3. Note that the sidelobes 802 shown in FIG. 8, have been pushed away from the main lobe peak 702, and some of the undesirable components 804 of the main lobe peak 702 have been filtered. Also note that the data indexing (the chips shown as the time axis) of FIG. 9 has changed relative to the data indexing of FIG. 8. As described above, this difference is an artifact of the software used to plot FIG. 7-FIG. 11 and is not associated with the applicant's invention.

FIG. 10 is a diagram presenting a more detailed view of the main lobe peak 702, showing the estimate of the communication channel impulse response (indicated by the asterisks) and the actual communication channel impulse response. Note that the estimated communication channel impulse response follows that of the actual response very closely.

Hardware Environment

FIG. 11 and is a diagram illustrating an exemplary processor system 1102 that could be used in the implementation of selected elements of the present invention (including, for example, portions of the transmitter 110, the receiver 112, the correlator 116, the estimator 120, or the filter 302).

The processor system 1102 comprises a processor 1104 and a memory 1106, such as random access memory (RAM). Generally, the processor system 1102 operates under control of an operating system 1108 stored in the memory 1106. Under control of the operating system 1108, the processor system 1102 accepts input data and commands and provides output data. Typically, the instructions for performing such operations are also embodied in an application program 1110, which is also stored in the memory 1106. The processor system 1102 may be embodied in a microprocessor, a desktop computer, or any similar processing device.

Instructions implementing the operating system 1108, the application program 1110, and the compiler 1112 may be tangibly embodied in a computer-readable medium, e.g., data storage device 1124, which could include one or more fixed or removable data storage devices, such as a zip drive, floppy disc drive, hard drive, CD-ROM drive, tape drive, etc. Further, the operating system 1108 and the application program 1110 are comprised of instructions which, when read and executed by the computer 1102, causes the computer 1102 to perform the steps necessary to implement and/or use the present invention. Application program 1110 and/or operating instructions may also be tangibly embodied in memory 1106 and/or data communications devices 1130, thereby making an application program product or article of manufacture according to the invention. As such, the terms “article of manufacture,” “program storage device” and “computer program product” as used herein are intended to encompass a computer program accessible from any computer readable device or media.

Those skilled in the art will recognize many modifications may be made to this configuration without departing from the scope of the present invention. For example, those skilled in the art will recognize that any combination of the above components, or any number of different components, peripherals, and other devices, may be used with the present invention. For example, an application-specific integrated circuit (ASIC) or a Field-Programmable Gate Array (FPGA) can be used to implement selected functions, including the correlator 116, and filtering functions can be performed by a general-purpose processor, as described above.

CONCLUSION

This concludes the description of the preferred embodiments of the present invention. The foregoing description of the preferred embodiment of the invention has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed. Many modifications and variations are possible in light of the above teaching. It is intended that the scope of the invention be limited not by this detailed description, but rather by the claims appended hereto. The above specification, examples and data provide a complete description of the manufacture and use of the composition of the invention. Since many embodiments of the invention can be made without departing from the spirit and scope of the invention, the invention resides in the claims hereinafter appended. 

1. A method of estimating a communication channel impulse response h(t), comprising the steps of: generating co_(m)(t)=co(t+mNT_(c)) for m=0, 1, Λ, M by correlating a received signal r(t) with a spreading sequence S_(i) of length N, wherein the received signal r(t) comprises a chip sequence c_(j) applied to a communication channel characterizable by an impulse response h(t), and wherein the chip sequence c_(j) is generated from a data sequence d_(i) spread by the spreading sequence S_(i) and wherein T_(c) is the chip period of the chip sequence c_(j); generating an estimated communication channel impulse response ĥ_(M)(t) as a combination of co_(m)(t) and d_(m) for m=0, 1, Λ, M; and filtering the first estimated communication channel impulse response ĥ_(M)(t) to generate the estimated communication channel impulse response h(t) with a filter f selected at least in part according to the spreading sequence S_(i).
 2. The method of claim 1, wherein the filter f is further selected at least in part according to an autocorrelation A(n) of the spreading sequence S_(i).
 3. The method of claim 2, wherein the filter f is further selected at least in part according to the duration of the impulse response of the communication channel h(t).
 4. The method of claim 2, wherein the filter f is further selected at least in part according to a zero-forcing criteria ${{\sum\limits_{i = {- L}}^{L}\left( {{A\left( {n - i} \right)} \cdot {f(i)}} \right)} = {A_{f}(n)}},{{- L} \leq n \leq L},$ wherein: f(i) is the impulse response of the filter f such that A_(f)(n) is a convolution of A(n) and f(i); A_(f) (n)=1 for n=0 and A_(f) (n)=0 for 0<|n|≦L; and ${{A(n)} = {{A\left( {- n} \right)} = {\sum\limits_{i = o}^{N - 1 - n}{S_{i} \cdot S_{i + n}}}}},{0 \leq n \leq N},$ and N is a length of the chip sequence S_(i).
 5. The method of claim 4, wherein: the parameter L is chosen such that a time duration of the impulse response of the communication channel h(t) is less than LT_(c).
 6. The method of claim 4, wherein: the parameter L is chosen such that a time duration of the impulse response of the communication channel h(t) is approximately equal to LT_(c).
 7. The method of claim 1, wherein N is less than
 20. 8. The method of claim 1, wherein M=0.
 9. The method of claim 1, wherein the data sequence d_(i) includes a constrained portion Cd_(i) associated with at least two codes w₀, w₁, wherein a correlation A_(code)(k) of the constrained portion Cd_(i) with one of the codes w₀, w₁ is characterized by a maximum value at k=0 less than maximum values at k≠0.
 10. The method of claim 9, wherein the step of generating an estimated communication channel impulse response ĥ_(M)(t) as a combination of co_(m)(t) and d_(m) for m=0, 1, Λ, M comprises the step of computing ĥ_(M)(t) as $\frac{1}{M}{\sum\limits_{m = 0}^{M - 1}{{d_{m} \cdot {co}}\quad{\left( {t + {mNT}_{c}} \right).}}}$
 11. The method of claim 10, wherein M=2.
 12. The method of claim 9, wherein the data sequence d_(i) includes a preamble having a pseudorandom code including the constrained portion of the data sequence d_(i).
 13. The method of claim 9, wherein A_(code)(k)=1 at k=0 and A_(code)(k)=0 for substantially all k≠0.
 14. The method of claim 9, wherein A_(code)(k)=0 for 0<|k|≦J, wherein J is selected to minimize the correlation of the constrained portion Cd_(i) with the one of the codes w₀, w₁ for substantially all k≠0.
 15. The method of claim 14, wherein 2J is a length of the constrained portion Cd_(i).
 16. The method of claim 1, wherein A_(code)(k)=1 at k=O and A_(code)(k)=0 for substantially all k≠0.
 17. The method of claim 1, wherein each of the two codes w₀, w₁ comprises two symbols.
 18. The method of claim 1, wherein the each of the two codes w₀, w₁ comprises no more than two symbols.
 19. The method of claim 1, wherein the codes w₀, w₁ comprise Walsh codes.
 20. An apparatus for estimating a communication channel impulse response h(t), comprising: means for generating co_(m)(t)=co(t+mNT_(c)) for m=0, 1, Λ, M by correlating a received signal r(t) with a spreading sequence S_(i) of length N, wherein the received signal r(t) comprises a chip sequence c_(j) applied to a communication channel characterizable by an impulse response h(t), and wherein the chip sequence c_(j) is generated from a data sequence d_(i) spread by the spreading sequence S_(i) and wherein T_(c) is the chip period of the chip sequence c_(j); means for generating an estimated communication channel impulse response ĥ_(M)(t) as a combination of co_(m)(t) and d_(m) for m=0, 1, Λ, M; and a filter means f, selected at least in part according to the spreading sequence S_(i), the filter means for filtering the first estimated communication channel impulse response ĥ_(M)(t) to generate the estimated communication channel impulse response h(t) with
 21. The apparatus of claim 20, wherein the filter means f is further selected at least in part according to an autocorrelation A(n) of the spreading sequence S_(i).
 22. The apparatus of claim 21, wherein the filter means f is further selected at least in part according to the duration of the impulse response of the communication channel h(t).
 23. The apparatus of claim 21, wherein the filter means f is further selected at least in part according to a zero-forcing criteria ${{\sum\limits_{i = {- L}}^{L}\left( {{A\left( {n - i} \right)} \cdot {f(i)}} \right)} = {A_{f}(n)}},{{- L} \leq n \leq L},$ wherein: f (i) is the impulse response of the filter means f such that A_(f)(n) is a convolution of A(n) and f(i); A_(f)(n)=1 for n=0 and A_(f)(n)=0 for 0<|n|≦L; and ${{A(n)} = {{A\left( {- n} \right)} = {\sum\limits_{i = o}^{N - 1 - n}{S_{i} \cdot S_{i + n}}}}},{0 \leq n \leq N},$ and N is a length of the chip sequence S_(i).
 24. The apparatus of claim 23, wherein: the parameter L is chosen such that a time duration of the impulse response of the communication channel h(t) is less than LT_(c).
 25. The apparatus of claim 23, wherein: the parameter L is chosen such that a time duration of the impulse response of the communication channel h(t) is approximately equal to LT_(c).
 26. The apparatus of claim 20, wherein N is less than
 20. 27. The apparatus of claim 20, wherein M=0.
 28. The apparatus of claim 20, wherein the data sequence d, includes a constrained portion Cd_(i) associated with at least two codes w₀, w₁, wherein a correlation A_(code)(k) of the constrained portion Cd_(i) with one of the codes w₀, w₁ is characterized by a maximum value at k=0 less than maximum values at k≠0.
 29. The apparatus of claim 28, wherein the means for generating an estimated communication channel impulse response ĥ_(M)(t) as a combination of co_(m)(t) and d_(m) for m=0, 1, Λ, M comprises means for computing ĥ_(M)(t) as $\frac{1}{M}{\sum\limits_{m = 0}^{M - 1}{{d_{m} \cdot {co}}\quad{\left( {t + {mNT}_{c}} \right).}}}$
 30. The apparatus of claim 29, wherein M=2.
 31. The apparatus of claim 28, wherein the data sequence d_(i) includes a preamble having a pseudorandom code including the constrained portion of the data sequence d_(i).
 32. The apparatus of claim 28, wherein A_(code)(k)=1 at k=0 and A_(code)(k)=0 for substantially all k≠0.
 33. The apparatus of claim 28, wherein A_(code)(k)=0 for 0<|k|≦J, wherein J is selected to minimize the correlation of the constrained portion Cd_(i) with the one of the codes w₀w₁ for substantially all k≠0.
 34. The apparatus of claim 33, wherein 2J is a length of the constrained portion Cd_(i).
 35. The apparatus of claim 20, wherein A_(code)(k)=1 at k=0 and A_(code)(k)=0 for substantially all k≠0.
 36. The apparatus of claim 20, wherein each of the two codes w₀, w₁ comprises two symbols.
 37. The apparatus of claim 20, wherein the each of the two codes w₀, w₁ comprises no more than two symbols.
 38. The apparatus of claim 20, wherein the codes w₀, w₁ comprise Walsh codes.
 39. An apparatus for estimating a communication channel impulse response h(t), comprising: a correlator generating co_(m)(t)=co(t+mNT_(c)) for m=0, 1, Λ, M by correlating a received signal r(t) with a spreading sequence S_(i) of length N, wherein the received signal r(t) comprises a chip sequence c_(j) applied to a communication channel characterizable by an impulse response h(t), and wherein the chip sequence c_(j) is generated from a data sequence d_(i) spread by the spreading sequence S_(i) and wherein T_(c) is the chip period of the chip sequence c_(j); an estimator for generating an estimated communication channel impulse response ĥ_(M)(t) as a combination of co_(m)(t) and d_(m) for m=0, 1, Λ, M; and a filter f selected at least in part according to the spreading sequence S_(i), the filter for filtering the first estimated communication channel impulse response ĥ_(M)(t) to generate the estimated communication channel impulse response h(t).
 40. The apparatus of claim 39, wherein the filter f is further selected at least in part according to an autocorrelation A(n) of the spreading sequence S_(i).
 41. The apparatus of claim 40, wherein the filter f is further selected at least in part according to the duration of the impulse response of the communication channel h(t).
 42. The apparatus of claim 40, wherein the filter f is further selected at least in part according to a zero-forcing criteria ${{\sum\limits_{i = {- L}}^{L}\left( {{A\left( {n - i} \right)} \cdot {f(i)}} \right)} = {A_{f}(n)}},{{- L} \leq n \leq L},$ wherein: f(i) is the impulse response of the filter f such that A_(f)(n) is a convolution of A(n) and f(i); A_(f)(n)=1 for n=0 and A_(f) (n)=0 for 0<|n|≦L; and ${{A(n)} = {{A\left( {- n} \right)} = {\sum\limits_{i = o}^{N - 1 - n}{S_{i} \cdot S_{i + n}}}}},{0 \leq n \leq N},$ and N is a length of the chip sequence S_(i).
 43. The apparatus of claim 42, wherein: the parameter L is chosen such that a time duration of the impulse response of the communication channel h(t) is less than LT_(c).
 44. The apparatus of claim 42, wherein: the parameter L is chosen such that a time duration of the impulse response of the communication channel h(t) is approximately equal to LT_(c).
 45. The apparatus of claim 39, wherein N is less than
 20. 46. The apparatus of claim 39, wherein M=0.
 47. The apparatus of claim 39, wherein the data sequence d_(i) includes a constrained portion Cd_(i) associated with at least two codes w₀, w₁, wherein a correlation A_(code)(k) of the constrained portion Cd_(i) with one of the codes w₀, w₁, is characterized by a maximum value at k=0 less than maximum values at k≠0.
 48. The apparatus of claim 47, wherein the estimator for generating an estimated communication channel impulse response ĥ_(M)(t) as a combination of co_(m)(t) and d_(m) for m=0, 1, Λ, M comprises means for computing ĥ_(M)(t) as $\frac{1}{M}{\sum\limits_{m = 0}^{M - 1}{{d_{m} \cdot {co}}\quad{\left( {t + {mNT}_{c}} \right).}}}$
 49. The apparatus of claim 48, wherein M=2.
 50. The apparatus of claim 47, wherein the data sequence d includes a preamble having a pseudorandom code including the constrained portion of the data sequence d_(i).
 51. The apparatus of claim 47, wherein A_(code)(k)=1 at k=0 and A_(code)(k)=0 for substantially all k≠0.
 52. The apparatus of claim 47, wherein A_(code)(k)=0 for 0<|k|≦J, wherein J is selected to minimize the correlation of the constrained portion Cd_(i) with the one of the codes w₀, w₁ for substantially all k≠0.
 53. The apparatus of claim 52, wherein 2J is a length of the constrained portion Cd_(i).
 54. The apparatus of claim 39, wherein A_(code)(k)=1 at k=O and A_(code)(k)=0 for substantially all k≠0.
 55. The apparatus of claim 39, wherein each of the two codes w₀, w₁ comprises two symbols.
 56. The apparatus of claim 39, wherein the each of the two codes w₀, w₁ comprises no more than two symbols.
 57. The apparatus of claim 39, wherein the codes w₀, w₁ comprise Walsh codes. 